Numerically satisfactory solutions of hypergeometric recursions
نویسندگان
چکیده
منابع مشابه
Numerically satisfactory solutions of hypergeometric recursions
Each family of Gauss hypergeometric functions fn = 2F1(a + ε1n, b + ε2n; c + ε3n; z), n ∈ Z , for fixed εj = 0,±1 (not all εj equal to zero) satisfies a second order linear difference equation of the form Anfn−1 + Bnfn + Cnfn+1 = 0. Because of symmetry relations and functional relations for the Gauss functions, many of the 26 cases (for different εj values) can be transformed into each other. I...
متن کاملTransitory minimal solutions of hypergeometric recursions and pseudoconvergence of associated continued fractions
Three term recurrence relations yn+1+bnyn+anyn−1 = 0 can be used for computing recursively a great number of special functions. Depending on the asymptotic nature of the function to be computed, different recursion directions need to be considered: backward for minimal solutions and forward for dominant solutions. However, some solutions interchange their role for finite values of n with respec...
متن کاملHypergeometric Solutions of Recurrences
We describe algorithm Hyper which can be used to nd all hypergeometric solutions of linear recurrences with polynomial coeecients.
متن کاملConical: an extended module for computing a numerically satisfactory pair of solutions of the differential equation for conical functions
Conical functions appear in a large number of applications in physics and engineering. In this paper we describe an extension of our module Conical (Gil et al., 2012) for the computation of conical functions. Specifically, the module includes now a routine for computing the function Rm − 1 2 +iτ (x), a real-valued numerically satisfactory companion of the function Pm − 1 2+iτ (x) for x > 1. In ...
متن کاملNested Recursions with Ceiling Function Solutions
Unless otherwise noted, we consider only n > 0. The parameters in (1.1) are all integers satisfying k, pi and aij > 0. Assume c initial conditions R(1) = ξ1, R(2) = ξ2, . . . , R(c) = ξc, with all ξi > 0. Golomb [6] first solved the simplest example of such a non-homogeneous nested recursion, namely, G(n) = G(n− G(n− 1)) + 1, G(1) = 1; see also [7]. In fact, all of the recursions we find with c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2007
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-07-01918-7